Memory efficient skeletonization of utility maps
نویسندگان
چکیده
An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what will be considered as a small component. Next, the skeleton parts are connected again at the middle of the overlap zones. Some examples are given for efficient memory utilization in tiling an A0 size map into a predefined number of tiles or into tiles of predefined (square) size. The algorithm is also suited for a parallel implementation of skeletonization.
منابع مشابه
Memory efficient propagation-based watershed and influence zone algorithms for large images
Propagation front or grassfire methods are very popular in image processing because of their efficiency and because of their inherent geodesic nature. However, because of their random-access nature, they are inefficient in large images that cannot fit in available random access memory. We explore ways to increase the memory efficiency of two algorithms that use propagation fronts: the skeletoni...
متن کاملA Novel Technique of Skeletonization for Feature Extraction in Cadastral Maps
A cadastral map is a map showing the boundaries and ownership of land parcels. The British evolved the present cadastral system for the purposes of governance and revenue collection. Cadastral maps can be treated as base maps for all land related information. Typically, these maps store information pertaining to ownership details, land use, areal extents, type of development that has been made ...
متن کاملMulti-Scale Model-Based Skeletonization of Object Shapes Using Self-Organizing Maps
In this paper, a new skeletonization algorithm suitable for the skeletonization of sparse shape is described. It is based on Self-Organizing Maps (SOM) – a class of neural networks with unsupervised learning. The so-called structured SOM with local shape attributes such as scale and connectivity of vertices are used to determine the object shape in the form of piecewise linear skeletons. The lo...
متن کاملComparison of the programming models for considering risk in farm planning:application of utility-efficient programming
متن کامل
Identification of secondary structure elements in intermediate-resolution density maps.
An increasing number of structural studies of large macromolecular complexes, both in X-ray crystallography and cryo-electron microscopy, have resulted in intermediate-resolution (5-10 A) density maps. Despite being limited in resolution, significant structural and functional information may be extractable from these maps. To aid in the analysis and annotation of these complexes, we have develo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997